Blind oracular quantum computation

In the standard oracle model, an efficiently evaluates unknown classical function independent of quantum algorithm itself. Quantum algorithms have a complex interrelationship to their oracles; for example possibility speedup is affected by manner which oracles are implemented. Therefore, it physically meaningful separate from algorithms, and we introduce one such separation here. We define Blind Oracular Computation (BOQC) scheme, in distinct node network. Our work augments client-server setting computing, powerful computer server available on network discreet use clients with low power. BOQC, another client that cooperates main so oracular run server. The cooperation between takes place (almost) without communication. prove BOQC be blind: cannot learn anything about clients' computation. This proof performed within composable security definitions provided formalism Abstract Cryptography. enhance scheme runnable minimal physical qubits when solid-state network; this refer as BOQCo (BOQC-optimized), possesses same BOQC.